Strain amplitude response and the microstructure of PA/clay nanocomposites

Polyamide 6/clay nanocomposites (PAn, where n is the mass fraction of clay) with various clay loading were prepared by melt compounding in a twin screw extruder. Exfoliation of clay in a PA matrix was confirmed by X-ray diffraction. Strain amplitude response of PAn in both melt and solution states has been investigated. In the melt state, critical strain amplitude of PAn is sensitive to strain amplitude response and decrease logarithmically with increasing clay loading. The elastic moduli (G′) of PAn are reversible under frequency loop sweeps. Comparisons of strain amplitude response in both melt and solution states have been conducted. Two different responses have been observed: strain thinning in the melt state and weak strain overshoot in the solution state. FTIR studies show that amide II band of PAn shifts toward high wavenumbers, but amide I band and N–H stretching vibration are independent of clay loading. We suggest that two types of strain amplitude response of PAn can be explained: strain thinning which is dominant in PAn caused by physical adsorption and entanglement of PA chains on nanoclays and weak strain overshoot caused by weak bonds between PA chains and nanoclays

The computation of previously inaccessible digits of π² and Catalan's constant

We recently concluded a very large mathematical calculation, uncovering objects that until recently were widely considered to be forever inaccessible to computation. Our computations stem from the “BBP” formula for π, which was discovered in 1997 using a computer program implementing the “PSLQ” integer relation algorithm. This formula has the remarkable property that it permits one to directly calculate binary digits of π, beginning at an arbitrary position d, without needing to calculate any of the first d - 1 digits. Since 1997 numerous other BBP-type formulas have been discovered for various mathematical constants, including formulas for π² (both in binary and ternary bases) and for Catalan’s constant. In this article we describe the computation of base-64 digits of π², base-729 digits of π², and base-4096 digits of Catalan’s constant, in each case beginning at the ten trillionth place, computations that involved a total of approximately 1:549 x 1019 floating-point operations. We also discuss connections between BBP-type formulas and the age-old unsolved questions of whether and why constants such as π; π²; log 2, and Catalan’s constant have “random” digits

Benchmark based on application signature to analyze and predict their behavior

Currently, there are benchmark sets that measure the performance of HPC systems under specific computing and communication properties. These benchmarks represent the kernels of applications that measure specific hardware components. If the user’s application is not represented by any benchmark, it is not possible to obtain an equivalent performance metric. In this work, we propose a benchmark based on the signature of an MPI application obtained by the PAS2P method. PAS2P creates the application signature in order to predict the execution time, which we believe will be very adjusted in relation to the execution time of the full application. The signature has two performance qualities: the bounded time to execute it (a benchmark property) and the quality of prediction. Therefore, we propose to extend the signature by giving the benchmark capacities such as the efficiency of the application over the HPC system. The performance metrics will be performed by the benchmark proposed. The experimentation validates our proposal with an average error of prediction close to 7%.Instituto de Investigación en Informátic

Evaluating the impact of post-qualifying social work education.

Post-qualifying awards in social work are well established within the continuing professional development agenda for qualified social workers in the UK. The evaluation of education and training should be an integral part of this agenda because it is important to ensure that programmes continue to meet standards of delivery, are successful in meeting their aims and objectives and are making an impact on practice. However, there is limited amount of published work on the evaluation of post-qualifying social work education, with studies often focusing on programme delivery rather than on their impact on practice. This paper explores evaluative work within the current post-qualifying social work framework, and discusses the results of an evaluation of the Vulnerable Adults and Community Care Practice programme, a specialist post-qualifying social work education programme run by a UK university, as an example of an evaluation of the impact on practice. The results indicate positive evidence of impact on practice and demonstrate examples of how the programme has had a direct effect on individuals, teams, organisations and on people who use services

Application of the DRA method to the calculation of the four-loop QED-type tadpoles

We apply the DRA method to the calculation of the four-loop `QED-type' tadpoles. For arbitrary space-time dimensionality D the results have the form of multiple convergent sums. We use these results to obtain the epsilon-expansion of the integrals around D=3 and D=4.Comment: References added, some typos corrected. Results unchange

The Borwein brothers, Pi and the AGM

We consider some of Jonathan and Peter Borweins' contributions to the high-precision computation of $\pi$ and the elementary functions, with particular reference to their book "Pi and the AGM" (Wiley, 1987). Here "AGM" is the arithmetic-geometric mean of Gauss and Legendre. Because the AGM converges quadratically, it can be combined with fast multiplication algorithms to give fast algorithms for the $n$-bit computation of $\pi$, and more generally the elementary functions. These algorithms run in almost linear time $O(M(n)\log n)$, where $M(n)$ is the time for $n$-bit multiplication. We outline some of the results and algorithms given in Pi and the AGM, and present some related (but new) results. In particular, we improve the published error bounds for some quadratically and quartically convergent algorithms for $\pi$, such as the Gauss-Legendre algorithm. We show that an iteration of the Borwein-Borwein quartic algorithm for $\pi$ is equivalent to two iterations of the Gauss-Legendre quadratic algorithm for $\pi$, in the sense that they produce exactly the same sequence of approximations to $\pi$ if performed using exact arithmetic.Comment: 24 pages, 6 tables. Changed style file and reformatted algorithms in v

A 2D algorithm with asymmetric workload for the UPC conjugate gradient method

This is a post-peer-review, pre-copyedit version of an article published in Journal of Supercomputing. The final authenticated version is available online at: https://doi.org/10.1007/s11227-014-1300-0[Abstract] This paper examines four different strategies, each one with its own data distribution, for implementing the parallel conjugate gradient (CG) method and how they impact communication and overall performance. Firstly, typical 1D and 2D distributions of the matrix involved in CG computations are considered. Then, a new 2D version of the CG method with asymmetric workload, based on leaving some threads idle during part of the computation to reduce communication, is proposed. The four strategies are independent of sparse storage schemes and are implemented using Unified Parallel C (UPC), a Partitioned Global Address Space (PGAS) language. The strategies are evaluated on two different platforms through a set of matrices that exhibit distinct sparse patterns, demonstrating that our asymmetric proposal outperforms the others except for one matrix on one platform.Ministerio de Economía y Competitividad; TIN2013-42148-PXunta de Galicia; GRC2013/055United States. Department of Energy; DEAC03-76SF0009

A parallel, distributed-memory framework for comparative motif discovery

The increasing number of sequenced organisms has opened new possibilities for the computational discovery of cis-regulatory elements ('motifs') based on phylogenetic footprinting. Word-based, exhaustive approaches are among the best performing algorithms, however, they pose significant computational challenges as the number of candidate motifs to evaluate is very high. In this contribution, we describe a parallel, distributed-memory framework for de novo comparative motif discovery. Within this framework, two approaches for phylogenetic footprinting are implemented: an alignment-based and an alignment-free method. The framework is able to statistically evaluate the conservation of motifs in a search space containing over 160 million candidate motifs using a distributed-memory cluster with 200 CPU cores in a few hours. Software available from http://bioinformatics.intec.ugent.be/blsspeller